On the flexibility of Metropolis-Hastings acceptance prob- abilities in auxiliary variable proposal generation
نویسنده
چکیده
Use of auxiliary variables for generating proposal variables within a MetropolisHastings setting has been suggested in many different settings. This has in particular been of interest for simulation from complex distributions such as multimodal distributions or in transdimensional approaches. For many of these approaches, the acceptance probabilities that are used turn up somewhat magic and different proofs for their validity have been given in each case. In this paper I will present a general framework for construction of acceptance probabilities in auxiliary variable proposal generation. In addition to demonstrate the similarities between many of the proposed algorithms in the literature, the framework also demonstrate that there is a great flexibility in how to construct such acceptance probabilities, in addition to the flexibility in how to construct the proposals. With this flexibility, alternative acceptance probabilities are suggested. Some numerical experiments are also reported.
منابع مشابه
On directional Metropolis-Hastings algorithms
Metropolis–Hastings algorithms are used to simulate Markov chains with limiting distribution equal to a specified target distribution. The current paper studies target densities on R. In directional Metropolis–Hastings algorithms each iteration consists of three steps i) generate a line by sampling an auxiliary variable, ii) propose a new state along the line, and iii) accept/reject according t...
متن کاملAn Efficient Minibatch Acceptance Test for Metropolis-Hastings
We present a novel Metropolis-Hastings method for large datasets that uses small expected-size minibatches of data. Previous work on reducing the cost of MetropolisHastings tests yield variable data consumed per sample, with only constant factor reductions versus using the full dataset for each sample. Here we present a method that can be tuned to provide arbitrarily small batch sizes, by adjus...
متن کاملMCMC for Doubly-intractable Distributions
Markov Chain Monte Carlo (MCMC) algorithms are routinely used to draw samples from distributions with intractable normalization constants. However, standard MCMC algorithms do not apply to doublyintractable distributions in which there are additional parameter-dependent normalization terms; for example, the posterior over parameters of an undirected graphical model. An ingenious auxiliary-varia...
متن کاملDirectional Metropolis–Hastings algorithms on hyperplanes
In this paper we define and study new directional Metropolis–Hastings algorithms that propose states in hyperplanes. Each iteration in directional Metropolis–Hastings algorithms consist of three steps. First a direction is sampled by an auxiliary variable. Then a potential new state is proposed in the subspace defined by this direction and the current state. Lastly, the potential new state is a...
متن کامل978 - 0 - 521 - 19676 - 5 - Bayesian Time Series Models
Abelian group, 278 acceptance probability, 24, 37, 246 adaptive Metropolis algorithm, 33 Akaike’s information criterion, 209, 320 alpha-beta recursion, 11, 390 annealed importance sampling, 321 aperiodic chain, 23 APF, see auxiliary particle filter AR model, see autoregressive model assumed density filtering, 17, 143, 388 autoregressive hidden Markov model, 185 autoregressive model, 4, 9, 111 a...
متن کامل